Consistency of Linear Inequalities Over Sets

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Relatively monotone variational inequalities over product sets

New concepts of monotonicity which extend the usual ones are introduced for variational inequality problems over product sets. They enable us to strengthen existence results and extend the eld of applications of the solution methods. c © 2001 Elsevier Science B.V. All rights reserved.

متن کامل

Feasibility and Constraint Analysis of Sets of Linear Matrix Inequalities

We present a constraint analysis methodology for Linear Matrix Inequality (LMI) constraints. If the constraint set is found to be feasible we search for a minimal representation; otherwise, we search for an irreducible infeasible system. The work is based on the solution of a set covering problem where each row corresponds to a sample point and is determined by constraint satisfaction at the sa...

متن کامل

Relatively B-pseudomonotone Variational Inequalities over Product of Sets

In this paper, we consider variational inequality problem over the product of sets which is equivalent to the problem of system of variational inequalities. These two problems are studied for single valued maps as well as for multivalued maps. New concept of pseudomonotonicity in the sense of Brézis is introduced to prove the existence of a solution of our problems. As an application of our res...

متن کامل

Automotive Control Revisited: Linear Inequalities as Approximation of Reachable Sets

Reachability analysis of hybrid system imposes restrictions on the continuous and discrete behavior. In this paper a method is proposed to approximate the reachable set of linear systems by linear inequalities. It allows to use the full continuous dynamics of hybrid systems for reachability analysis. This method is applied to an automotive control problem, which was presented by Stauner et al. ...

متن کامل

Linear Inequalities for Enumerating Chains in Partially Ordered Sets

We characterize the linear inequalities satisfied by flag f -vectors of all finite bounded posets. We do the same for semipure posets. In particular, the closed convex cone generated by flag f -vectors of bounded posets of fixed rank is shown to be simplicial, and the closed cone generated by flag f -vectors of semipure posets of fixed rank is shown to be polyhedral. The extreme rays of both of...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Proceedings of the American Mathematical Society

سال: 1972

ISSN: 0002-9939

DOI: 10.2307/2039028